Educational Robotics in Algorithm Concretization

نویسندگان

  • Javier LÓPEZ
  • Niko MYLLER
چکیده

Algorithm concretization with robots combines hands-on robotics and traditional algorithm visualization techniques to assist diverse learners to understand the basic idea of a given algorithm. In this way, we bring algorithms into the real physical world where students can touch the data structures during the execution. We present a proof-of-concept implementation with a few sorting algorithms. Moreover, we have carried out an evaluation with 13-to-15-year old children who used the concretization to comprehend an algorithm. The results indicate that algorithm concretization can enhance their learning process. Our implementation experience and the analysis of the experiment give new directions to the further development for both the educational robotics and the learning environment. Our aim is to build a new learning environment that helps students to understand algorithms and to acquire programming skills through concretization with robotics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Concretization for Parallel Program Synthesis

Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces synthesis to a formula passed to a SAT solver, and explicit search, which uses brute force or random search to find a solution. In this paper, we propose adaptive concretization, a novel synthesis algorithm that combines the best ...

متن کامل

An empirical study of adaptive concretization for parallel program synthesis

Adaptive concretization is a program synthesis technique that enables efficient parallelization of challenging synthesis problems. The key observation behind adaptive concretization is that in a challenging synthesis problem, there are some unknowns that are best suited for explicit search and some that are best suited for symbolic search through constraint solving. At a high level, the main id...

متن کامل

An Approach to Reducing Overfitting in FCM with Evolutionary Optimization

Fuzzy clustering methods are conveniently employed in constructing a fuzzy model of a system, but they need to tune some parameters. In this research, FCM is chosen for fuzzy clustering. Parameters such as the number of clusters and the value of fuzzifier significantly influence the extent of generalization of the fuzzy model. These two parameters require tuning to reduce the overfitting in the...

متن کامل

Bio-inspired cost-aware optimization for data-intensive service provision

The rapid proliferation of enormous sources of digital data and the development of cloud computing have led to greater dependence on data-intensive services. Each service may actually request or create a large amount of data sets. The scope, number, and complexity of data-intensive services are all set to soar in the future. To compose these services will be more challenging. Issues of autonomy...

متن کامل

Detection of Breast Cancer Progress Using Adaptive Nero Fuzzy Inference System and Data Mining Techniques

Prediction, diagnosis, recovery and recurrence of the breast cancer among the patients are always one of the most important challenges for explorers and scientists. Nowadays by using of the bioinformatics sciences, these challenges can be eliminated by using of the previous information of patients records. In this paper has been used adaptive nero fuzzy inference system and data mining techniqu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004